A trajectory data publishing algorithm satisfying local suppression
نویسندگان
چکیده
منابع مشابه
Privacy-preserving trajectory data publishing by local suppression
The pervasiveness of location-aware devices has spawned extensive research in trajectory data mining, resulting in many important real-life applications. Yet, the privacy issue in sharing trajectory data among different parties often creates an obstacle for effective data mining. In this paper, we study the challenges of anonymizing trajectory data: high dimensionality, sparseness, and sequenti...
متن کاملTrPLS: Preserving Privacy in Trajectory Data Publishing by Personalized Local Suppression
Trajectory data are becoming more popular due to the rapid development of mobile devices and the widespread use of location-based services. They often provide useful information that can be used for data mining tasks. However, a trajectory database may contain sensitive attributes, such as disease, job, and salary, which are associated with trajectory data. Hence, improper publishing of the tra...
متن کاملDifferentially Private Real-Time Data Publishing over Infinite Trajectory Streams
Recent emerging mobile and wearable technologies make it easy to collect personal spatiotemporal data such as activity trajectories in daily life. Publishing real-time statistics over trajectory streams produced by crowds of people is expected to be valuable for both academia and business, answering questions such as “How many people are in Kyoto Station now?” However, analyzing these raw data ...
متن کاملA watermarking algorithm satisfying topological chaos properties
A new watermarking algorithm is given, it is based on the so-called chaotic iterations and on the choice of some coefficients which are deduced from the description of the carrier medium. After defining these coefficients, chaotic discrete iterations are used to encrypt the watermark and to embed it in the carrier medium. This procedure generates a topological chaos and ensures that the require...
متن کاملA Local Refinement Algorithm for Data Partitioning
A local reenement method for data partitioning has been constructed. The method balances the workload and minimizes locally the number of edge-cuts. If the initial partitioning is globally good the algorithm converges rapidly with good results. Moreover, the arithmetic complexity of an iteration is very low. The method is well suited for reenement in multilevel partitioning where the intermedia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2021
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147721993402